Face antimagic labelings of toroidal and Klein bottle grid graphs
نویسندگان
چکیده
منابع مشابه
Antimagic Labelings of Weighted and Oriented Graphs∗
A graph G is k–weighted–list–antimagic if for any vertex weighting ω : V (G) → R and any list assignment L : E(G)→ 2R with |L(e)| ≥ |E(G)|+k there exists an edge labeling f such that f(e) ∈ L(e) for all e ∈ E(G), labels of edges are pairwise distinct, and the sum of the labels on edges incident to a vertex plus the weight of that vertex is distinct from the sum at every other vertex. In this pa...
متن کاملConstructions of antimagic labelings for some families of regular graphs
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کاملOn d-antimagic labelings of plane graphs
The paper deals with the problem of labeling the vertices and edges of a plane graph in such a way that the labels of the vertices and edges surrounding that face add up to a weight of that face. A labeling of a plane graph is called d-antimagic if for every positive integer s, the s-sided face weights form an arithmetic progression with a difference d. Such a labeling is called super if the sm...
متن کاملVertex-antimagic total labelings of graphs
In this paper we introduce a new type of graph labeling, the (a, d)vertex-antimagic total labeling, which is a generalization of several other types of labelings. A connected graph G(V, E) is said to be (a, d)-vertex-antimagic total if there exist positive integers a, d and a bijection λ : V ∪ E → {1, 2, . . . , |V | + |E|} such that the induced mapping gλ : V → W is also a bijection, where W =...
متن کامل2-extendability of toroidal polyhexes and Klein-bottle polyhexes
A toroidal polyhex (resp. Klein-bottle polyhex) described by a string (p, q, t) arises from a p × q-parallelogram of a hexagonal lattice by a usual torus (resp. Klein bottle) boundary identification with a torsion t. A connected graph G admitting a perfect matching is kextendable if |V(G)| ≥ 2k + 2 and any k independent edges can be extended to a perfect matching of G. In this paper, we charact...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2020
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2018.09.005